Parity problem with a cellular automaton solution
نویسندگان
چکیده
منابع مشابه
Parity Problem With A Cellular Automaton Solution
The parity of a bit string of length N is a global quantity that can be efficiently computed using a global counter in O(N) time. But is it possible to find the parity using cellular automata with a set of local rule tables without using any global counter? Here, we report a way to solve this problem using a number of r=1 binary, uniform, parallel, and deterministic cellular automata applied in...
متن کاملModulo Three Problem With A Cellular Automaton Solution
Abstract An important global property of a bit string is the number of ones in it. It has been found that the parity (odd or even) of this number can be found by a sequence of deterministic, translational invariant cellular automata with parallel update in succession for a total of O(N2) time. In this paper, we discover a way to check if this number is divisible by three using the same kind of ...
متن کاملar X iv : n lin . C G / 0 10 20 26 v 2 3 M ay 2 00 1 Parity Problem With A Cellular Automaton Solution
The parity of a bit string of length N is a global quantity that can be efficiently compute using a global counter in O(N) time. But is it possible to find the parity using cellular automata with a set of local rule tables without using any global counter? Here, we report a way to solve this problem using a number of r = 1 binary, uniform, parallel and deterministic cellular automata applied in...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملSolution to the strong CP problem: Supersymmetry with parity.
We find that supersymmetry with parity can solve the strong CP problem in many cases including the interesting cases of having the minimal supersymmetric standard model or some of its extensions below the Planck/GUT/intermediate scales, as well as for the case where we have a low-energy SUSY left-right model. The smallest dimensionless parameter in the standard model is the strong CP phase, θ̄ =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2001
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.64.026702